Sequence Dependent Scheduling Optimization on Plastic Injection Line with Tabu Search Method

نویسندگان

چکیده

In today's production conditions, it is very important for companies to produce products that meet the determined quality standards. addition of semi-finished produced in plastic injection lines with high and efficiency, aimed reduce lost time waste materials production. Since automobile headlights can be many different colors, necessary keep product at a level transition between colors made by number defective caused color errors. this study, problem single row-dependent machine amount occurs transitions line an automotive side-industry company producing discussed. Tabu Search method, which one heuristic optimization algorithms was used solve problem. solution, sequences will program were created using annual data kept department factory. The algorithm run from two machines out 18, saving 134 kg materials. It has been clarified if developed applied all department, productivity increased

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

متن کامل

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

Structural Optimization with Tabu Search

A class of search techniques for discrete optimization problems, Heuristic Search Methods, and their suitability for structural optimization are studied. The Tabu Search method is selected for application to structural weight optimization of skeleton structures. The search method is first tested to find the minima of a function in a non-linear non-convex optimization mathematical problem, and a...

متن کامل

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine

This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between two jobs comprises an unrestricted setup that can be performed at any time, and a restricted setup that must be performed outside of given time interv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Academic platform-Journal of engineering and science

سال: 2021

ISSN: ['2147-4575']

DOI: https://doi.org/10.21541/apjes.923838